A Garside-theoretic Approach to the Reducibility Problem in Braid Groups Eon-kyung Lee and Sang
نویسنده
چکیده
Let Dn denote the n-punctured disk in the complex plane, where the punctures are on the real axis. An n-braid α is said to be reducible if there exists an essential curve system C in Dn, called a reduction system of α, such that α ∗ C = C where α ∗ C denotes the action of the braid α on the curve system C. A curve system C in Dn is said to be standard if each of its components is isotopic to a round circle centered at the real axis. In this paper, we study the characteristics of the braids sending a curve system to a standard curve system, and then the characteristics of the conjugacy classes of reducible braids. For an essential curve system C inDn, we define the standardizer of C as St(C) = {P ∈ B + n : P ∗C is standard} and show that St(C) is a sublattice of B + n . In particular, there exists a unique minimal element in St(C). Exploiting the minimal elements of standardizers together with canonical reduction systems of reducible braids, we define the outermost component of reducible braids, and then show that, for the reducible braids whose outermost component is simpler than the whole braid (including split braids and reducible braids with periodic outermost component), each element of its ultra summit set has a standard reduction system. This implies that, for such braids, finding a reduction system is as easy as finding a single element of the ultra summit set.
منابع مشابه
Translation Numbers in a Garside Group Are Rational with Uniformly Bounded Denominators
It is known that Garside groups are strongly translation discrete. In this paper, we show that the translation numbers in a Garside group are rational with uniformly bounded denominators and can be computed in finite time. As an application, we give solutions to some group-theoretic problems.
متن کاملTranslation Numbers in a Garside Group Are Rational with Uniformly Bounded Denominators Eon-kyung Lee and Sang
It is known that Garside groups are strongly translation discrete. In this paper, we show that the translation numbers in a Garside group are rational with uniformly bounded denominators and can be computed in finite time. As an application, we give solutions to some group-theoretic problems. 2000 Mathematics Subject Classification: 20F10; 20F36
متن کاملAbelian Subgroups of Garside Groups Eon-kyung Lee and Sang
In this paper, we show that for every abelian subgroup H of a Garside group, some conjugate gHg consists of ultra summit elements and the centralizer of H is a finite index subgroup of the normalizer of H. Combining with the results on translation numbers in Garside groups, we obtain an easy proof of the algebraic flat torus theorem for Garside groups and solve several algorithmic problems conc...
متن کاملStable Super Summit Sets in Garside Groups
The known algorithms for solving the conjugacy problem in Garside groups involve computing a particular subset of the conjugacy class, the so-called super summit set. The super summit set [g] of an element g in a Garside group is, intuitively, the set of all conjugates of g that have the shortest normal form in the conjugacy class of g. In this paper, we define the stable super summit set [g] o...
متن کاملGrowth of Minimal Word-length in Garside Groups
The Garside group, as a generalization of braid groups and Artin groups of finite types, is defined as the group of fractions of a Garside monoid. We show that the semidirect product of Garside monoids is a Garside monoid. We use the semidirect product Z ⋉ G of the infinite cyclic group Z and the cartesian product G of a Garside group G to study the properties of roots and powers of elements in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009